Hierarchical routing over dynamic wireless networks

A New Hierarchical Routing Protocol for Dynamic Multihop Wireless Networks

T h e routing techniques used in Conventional packet radio networks are n o t suitable for dynamic multihop wireless networks because of their unique architecture. In this paper, a n e w hierarchical multihop routing algorithm is introduced which balances the cost of locationupdate and path-finding operations by partitioning the terminals and mobile base stations t o produce a virtual topology....

Hierarchical Routing Protocols in Wireless Sensor Networks

Hierarchical Routing Protocols in Wireless Sensor Networks

Hierarchical Routing in Low-Power Wireless Networks

Hierarchical Routing in Low-Power Wireless Networks

POINT-TO-POINT routing is fundamental functionality in the Internet. Its objective is finding paths in the network along which any two devices (nodes) in different parts of the globe can exchange data with each other. It is the only functionality shared by all Internet nodes, be they in the Internet core or at its end-points, and conversely, to be a fully-fledged Internet node, any novel device...

Hierarchical Routing in Dynamic α-Doubling Networks

In this paper we formulate the problem of routing over dynamic networks with finite doubling dimension. This is motivated by communication in mobile wireless networks, where the communication graph topology changes over time, but has some geometric properties, motivating the model for finite doubling dimension. Since wireless network bandwidth is precious, we consider communication cost require...